An extremal problem arising in soil erosion modeling
نویسندگان
چکیده
منابع مشابه
An extremal eigenvalue problem arising in heat conduction
This article is devoted to the study of two extremal problems arising naturally in heat conduction processes. We look for optimal configurations of thermal axisymmetric fins and model this problem as the issue of (i) minimizing (for the worst shape) or (ii) maximizing (for the best shape) the first eigenvalue of a selfadjoint operator having a compact inverse. We impose a pointwise lower bound ...
متن کاملTowards the reproducibility in soil erosion modeling: a new Pan-European soil erosion map
Soil erosion by water is a widespread phenomenon throughout Europe and has the potentiality, with his on-site and off-site effects, to affect water quality, food security and floods. Despite the implementation of numerous and different models for estimating soil erosion by water in Europe, there is still a lack of harmonization of assessment methodologies. Often, different approaches result in ...
متن کاملComputer Erosion Modeling Considering Soil Hydraulic Conductivity
Improved computer models of erosion have been developed, considering soil hydraulic conductivity. The models deal with erosion of levees, dams and embankments due to overtopping. The simulations trace the formation of rills and gullies, beginning with initial overtopping and continuing to final breaching. Physical models performed at 1-g and high g using a geotechnical centrifuge have been used...
متن کاملAn Extremal Problem for Polynomials
Let f(z) = z" Hbe a polynomial such that the level set E = {z : |/(z)| < 1} is connected. Then max{|/'(z)| : z e E} < 2<1/")-1n2 , and this estimate is the best possible. The following question was asked in [1, Problem 4.8]. Let f be a polynomial of degree n, (1) f{z)~z», z^oo. Put Ef = {z : \f(z)\ < 1} , and assume that Ef is connected. Is it true that (2) max{\f'(z)\:z£Ef}. Pommerenke ...
متن کاملAn Extremal Problem in Generalized Ramsey Theory
A connected graph G of order n is called m-good if r(Km ,G) = (m-1)(n-1) + 1 . Let f(m,n) be the largest integer q such that every connected graph of order n and size q is m-good and let g(m,n) be the largest q for which there exists a connected graph G of order n and size q which is m-good . Asymptotic bounds are given for f and g . 1 . Tntroduction . One of the most notable yet simply proved ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Applicationes Mathematicae
سال: 1988
ISSN: 1233-7234,1730-6280
DOI: 10.4064/am-20-2-281-289